A constraint solving approach to model reduction by tropical equilibration
نویسندگان
چکیده
منابع مشابه
A Constraint Solving Approach to Tropical Equilibration and Model Reduction
Model reduction is a central topic in systems biology and dynamical systems theory, for reducing the complexity of detailed models, finding important parameters, and developing multi-scale models for instance. While perturbation theory is a standard mathematical tool to analyze the different time scales of a dynamical system, and decompose the system accordingly, tropical methods provide a simp...
متن کاملModel-Order Reduction Using Interval Constraint Solving Techniques
Many natural phenomena can be modeled as ordinary or partial differential equations. A way to find solutions of such equations is to discretize them and to solve the corresponding (possibly) nonlinear large systems of equations; see (Li and Chen, 2008). Solving a large nonlinear system of equations is very computationally complex due to several numerical issues, such as high linear-algebra cost...
متن کاملA General Approach for Constraint Solving by Local Search
In this paper, we present a general approach for solving constraint problems by local search. The proposed approach is based on a set of high-level constraint primitives motivated by constraint programming systems. These constraints constitute the basic bricks to formulate a given combinatorial problem. A tabu search engine ensures the resolution of the problem such formulated. Experimental res...
متن کاملApproach to Parton Equilibration *
Perturbative QCD-based models of parton production and equilibration in ultrarela-tivistic heavy ion collisions are reviewed with an emphasis on the treatment of quantum interference effects. Uncertainties in the initial parton production and their effects on later parton equilibration are considered. Probes of early parton dynamics are also discussed.
متن کاملA translational approach to constraint answer set solving
We present a new approach to enhancing Answer Set Programming (ASP) with Constraint Processing techniques which allows for solving interesting Constraint Satisfaction Problems in ASP. We show how constraints on finite domains can be decomposed into logic programs such that unit-propagation achieves arc, bound or range consistency. Experiments with our encodings demonstrate their computational i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithms for Molecular Biology
سال: 2014
ISSN: 1748-7188
DOI: 10.1186/preaccept-1468617733126024